The Recursive Core for Non-Superadditive Games

نویسندگان

  • Chen-Ying Huang
  • Tomas Sjöström
چکیده

In general partition function form games, the recursive core coalition structure may be either coarser or finer than the one that maximizes the social surplus. Moreover, the recursive core structure is typically different from the one predicted by the α-core. We fully implement the recursive core for general games, including non-superadditive games where the grand coalition does not form in equilibrium. JEL classification number: C71, C72

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stability Via Convexity and LP Duality in OCF Games

The core is a central solution concept in cooperative game theory, and therefore it is important to know under what conditions the core of a game is guaranteed to be non-empty. Two notions that prove to be very useful in this context are Linear Programming (LP) duality and convexity. In this work, we apply these tools to identify games with overlapping coalitions (OCF games) that admit stable o...

متن کامل

Farsighted coalitional stability in TU-games

We study farsighted coalitional stability in the context of TUgames. Chwe (1994, p.318) notes that, in this context, it is difficult to prove nonemptiness of the largest consistent set. We show that every TU-game has a nonempty largest consistent set. Moreover, the proof of this result points out that each TU-game has a farsighted stable set. We go further by providing a characterization of the...

متن کامل

The core and the bargaining set for convex games

Within the class of superadditive cooperative games with transferable utility, the convexity of a game is characterized by the coincidence of its core and the steady bargaining set. As a consequence it is also proved that convexity can also be characterized by the coincidence of the core of a game and the modified Zhou bargaining set (Shimomura, 1997)

متن کامل

The least core, kernel and bargaining sets of large games

We study the least core, the kernel and bargaining sets of coalitional games with a countable set of players. We show that the least core of a continuous superadditive game with a countable set of players is a nonempty (norm-compact) subset of the space of all countably additive measures. Then we show that in such games the intersection of the prekernel and the least core is non-empty. Finally,...

متن کامل

The socially stable core in structured transferable utility games

We consider cooperative games with transferable utility (TU-games), in which we allow for a social structure on any coalition, for instance a network, a hierarchical ordering or a dominance relation. For every coalition the relative strength of a player within that coalition is induced by its social structure and is measured by a power function. We call a payoff vector socially stable if there ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Games

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2010